Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
نویسندگان
چکیده
منابع مشابه
Weighted aggregation for multi-level graph partitioning
Graph partitioning is a technique which is widely used in many fields of computer science and engineering. The goal is to partition the vertices of a graph into a certain number of disjoint sets of approximately the same size, so that a cut metric is minimized. Due to the NP-hardness of the problem and its practical importance, many different heuristics (spectral, combinatorial, evolutionist, e...
متن کاملContinuous bottleneck tree partitioning problems
We study continuous partitioning problems on tree network spaces whose edges and nodes are points in Euclidean spaces. A continuous partition of this space into p connected components is a collection of p subtrees, such that no pair of them intersect at more than one point, and their union is the tree space. An edge-partition is a continuous partition de3ned by selecting p − 1 cut points along ...
متن کاملThe graph bottleneck identity
A matrix S = (sij) ∈ R n×n is said to determine a transitional measure for a digraph Γ on n vertices if for all i, j, k ∈ {1, . . . , n}, the transition inequality sij sjk ≤ sik sjj holds and reduces to the equality (called the graph bottleneck identity) if and only if every path in Γ from i to k contains j. We show that every positive transitional measure produces a distance by means of a loga...
متن کاملA Graph Bottleneck Inequality
For a weighted directed multigraph, let fij be the total weight of spanning converging forests that have vertex i in a tree converging to j. We prove that fij fjk = fik fjj if and only if every directed path from i to k contains j (a graph bottleneck equality). Otherwise, fij fjk < fik fjj (a graph bottleneck inequality). In a companion paper [1] (P. Chebotarev, A new family of graph distances,...
متن کاملPolyhedral Computations for the Simple Graph Partitioning Problem
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal. In this paper we present a branch-and-cut algorithm for the problem that uses several classes of facet-defining inequalities as cuttingplanes. These are b-tree, clique, cycl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2012
ISSN: 0893-9659
DOI: 10.1016/j.aml.2012.04.015